A set-covering formulation for a drayage problem with single and double container loads

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Local Branching Approach for the Set Covering Problem

The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...

متن کامل

Single ‎A‎ssignment Capacitated Hierarchical Hub Set Covering Problem for Service Delivery Systems Over Multilevel Networks

The present study introduced a novel hierarchical hub set covering problem with capacity constraints. This study showed the significance of fixed charge costs for locating facilities, assigning hub links and designing a productivity network. The proposed model employs mixed integer programming to locate facilities and establish links between nodes according to the travel time between an origin-...

متن کامل

A Robust Formulation of the Uncertain Set Covering Problem

This work introduces a robust formulation of the uncertain set covering problem combining the concepts of robust and probabilistic optimization and defines ’Γ-robust α-covers’. It is shown that the proposed robust uncertain set covering problem can be stated as a compact mixed-integer linear programming model which can be solved with modern computer software. This model is a natural extension o...

متن کامل

a local branching approach for the set covering problem

the set covering problem (scp) is a well-known combinatorial optimization problem. this paper investigates development of a local branching approach for the scp. this solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. the algorithm parameters are tuned by design of experiments approach. the proposed method is te...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Industrial Engineering International

سال: 2018

ISSN: 1735-5702,2251-712X

DOI: 10.1007/s40092-018-0256-8